Alphabet-independent optimal parallel search for three-dimensional patterns
نویسندگان
چکیده
منابع مشابه
Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns
We give an alphabet-independent optimal parallel algorithm for the searching phase of three-dimensional pattern-matching. All occurrences of a three dimensional pattern P of shape mmm in a text T of shape n n n are to be found. Our algorithm works in log m time with O(N= log(m)) processors of a CREW PRAM, where N = n 3. The ideas from 3] are used. Surprisingly, the extension of the two dimensio...
متن کاملAn Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern
We give an alphabet-independent optimal parallel algorithm for the searching phase of three dimensional pattern-matching. All occurrences of a three dimensional pattern P of shape m m m in a text T of shape nn n are to be found. Our algorithm works in log m time with O(N= log(m)) processors of a CREW PRAM, where N = n 3. The searching phase in three dimensions explores classiication of two-dime...
متن کاملOptimal Parallel Preconditioners for Three-Dimensional Particulate Flows
Simulation of incompressible flows with hundreds of rigid particles in three-dimensional domains require efficient iterative algorithms and parallel preconditioners. In addition to the difficulty associated with solving Navier-Stokes equations for incompressible fluids, one must simulate the motion of rigid bodies under the action of hydrodynamic forces and gravity. A distributed Lagrange multi...
متن کاملThrust - Limited Optimal Three - Dimensional Spacecraft Trajectories
Several optimal three-dimensional orbital transfer problems are solved for thrust-limited spacecrafts using collocation and nonlinear programming techniques. The solutions for full nonlinear equations of motion are obtained where the integrals of the free Keplerian motion in three dimensions are utilized for coasting arcs. In order to limit the solution space, interior-point constraints are use...
متن کاملConstrained optimal fitting of three-dimensional vector patterns
This paper addresses the problem of finding whether a given set of three-dimensional (3-D) vectors (the object) can be brought to match a second set of vectors (the template) by means of an affine motion, minimizing a measure of the mismatch error and satisfying an assigned set of geometrical constraints. This problem is encountered in many applications of computer vision, robotics, and manufac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00252-1